0.01/0.10 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.10/0.13 % Command : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC 0.12/0.33 % Computer : n018.cluster.edu 0.12/0.33 % Model : x86_64 x86_64 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.33 % Memory : 8042.1875MB 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.33 % CPULimit : 1200 0.12/0.33 % WCLimit : 120 0.12/0.33 % DateTime : Tue Jul 13 16:08:08 EDT 2021 0.12/0.33 % CPUTime : 0.12/0.34 % Number of cores: 8 0.12/0.34 % Python version: Python 3.6.8 0.12/0.34 # Version: 2.6rc1-ho 0.12/0.35 # No SInE strategy applied 0.12/0.35 # Trying AutoSched0 for 59 seconds 0.18/0.45 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S4d 0.18/0.45 # and selection function SelectCQIPrecWNTNp. 0.18/0.45 # 0.18/0.45 # Preprocessing time : 0.061 s 0.18/0.45 # Presaturation interreduction done 0.18/0.45 0.18/0.45 # Proof found! 0.18/0.45 # SZS status Theorem 0.18/0.45 # SZS output start CNFRefutation 0.18/0.45 thf(fact_8_psums__replicate__0__append, axiom, ![X1:nat, X547:list_a]:(descar1375166517sums_a @ (append_a @ (replicate_a @ X1 @ zero_zero_a) @ X547))=(append_a @ (replicate_a @ X1 @ zero_zero_a) @ (descar1375166517sums_a @ X547)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_8_psums__replicate__0__append)). 0.18/0.45 thf(conj_0, conjecture, (descar1375166517sums_a @ xsa)=(append_a @ (replicate_a @ p @ zero_zero_a) @ (descar1375166517sums_a @ (cons_a @ (nth_a @ xsa @ p) @ xs2))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', conj_0)). 0.18/0.45 thf(fact_5_xs1__def, axiom, (xs1)=(replicate_a @ p @ zero_zero_a), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_5_xs1__def)). 0.18/0.45 thf(fact_6_xs__decompose, axiom, (xsa)=(append_a @ xs1 @ (cons_a @ (nth_a @ xsa @ p) @ xs2)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_6_xs__decompose)). 0.18/0.45 thf(c_0_4, plain, ![X2511:nat, X2512:list_a]:(descar1375166517sums_a @ (append_a @ (replicate_a @ X2511 @ zero_zero_a) @ X2512))=(append_a @ (replicate_a @ X2511 @ zero_zero_a) @ (descar1375166517sums_a @ X2512)), inference(variable_rename,[status(thm)],[fact_8_psums__replicate__0__append])). 0.18/0.45 thf(c_0_5, negated_conjecture, (descar1375166517sums_a @ xsa)!=(append_a @ (replicate_a @ p @ zero_zero_a) @ (descar1375166517sums_a @ (cons_a @ (nth_a @ xsa @ p) @ xs2))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])])). 0.18/0.45 thf(c_0_6, plain, ![X1:nat, X10:list_a]:(descar1375166517sums_a @ (append_a @ (replicate_a @ X1 @ zero_zero_a) @ X10))=(append_a @ (replicate_a @ X1 @ zero_zero_a) @ (descar1375166517sums_a @ X10)), inference(split_conjunct,[status(thm)],[c_0_4])). 0.18/0.45 thf(c_0_7, plain, (xs1)=(replicate_a @ p @ zero_zero_a), inference(split_conjunct,[status(thm)],[fact_5_xs1__def])). 0.18/0.45 thf(c_0_8, negated_conjecture, (descar1375166517sums_a @ xsa)!=(append_a @ (replicate_a @ p @ zero_zero_a) @ (descar1375166517sums_a @ (cons_a @ (nth_a @ xsa @ p) @ xs2))), inference(split_conjunct,[status(thm)],[c_0_5])). 0.18/0.45 thf(c_0_9, plain, ![X10:list_a]:(descar1375166517sums_a @ (append_a @ xs1 @ X10))=(append_a @ xs1 @ (descar1375166517sums_a @ X10)), inference(spm,[status(thm)],[c_0_6, c_0_7])). 0.18/0.45 thf(c_0_10, plain, (xsa)=(append_a @ xs1 @ (cons_a @ (nth_a @ xsa @ p) @ xs2)), inference(split_conjunct,[status(thm)],[fact_6_xs__decompose])). 0.18/0.45 thf(c_0_11, negated_conjecture, (append_a @ xs1 @ (descar1375166517sums_a @ (cons_a @ (nth_a @ xsa @ p) @ xs2)))!=(descar1375166517sums_a @ xsa), inference(rw,[status(thm)],[c_0_8, c_0_7])). 0.18/0.45 thf(c_0_12, plain, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9, c_0_10]), c_0_11]), ['proof']). 0.18/0.45 # SZS output end CNFRefutation 0.18/0.45 # Proof object total steps : 13 0.18/0.45 # Proof object clause steps : 7 0.18/0.45 # Proof object formula steps : 6 0.18/0.45 # Proof object conjectures : 4 0.18/0.45 # Proof object clause conjectures : 2 0.18/0.45 # Proof object formula conjectures : 2 0.18/0.45 # Proof object initial clauses used : 4 0.18/0.45 # Proof object initial formulas used : 4 0.18/0.45 # Proof object generating inferences : 2 0.18/0.45 # Proof object simplifying inferences : 2 0.18/0.45 # Training examples: 0 positive, 0 negative 0.18/0.45 # Parsed axioms : 399 0.18/0.45 # Removed by relevancy pruning/SinE : 0 0.18/0.45 # Initial clauses : 635 0.18/0.45 # Removed in clause preprocessing : 72 0.18/0.45 # Initial clauses in saturation : 563 0.18/0.45 # Processed clauses : 722 0.18/0.45 # ...of these trivial : 25 0.18/0.45 # ...subsumed : 108 0.18/0.45 # ...remaining for further processing : 589 0.18/0.45 # Other redundant clauses eliminated : 142 0.18/0.45 # Clauses deleted for lack of memory : 0 0.18/0.45 # Backward-subsumed : 0 0.18/0.45 # Backward-rewritten : 9 0.18/0.45 # Generated clauses : 206 0.18/0.45 # ...of the previous two non-trivial : 82 0.18/0.45 # Contextual simplify-reflections : 2 0.18/0.45 # Paramodulations : 93 0.18/0.45 # Factorizations : 0 0.18/0.45 # NegExts : 0 0.18/0.45 # Equation resolutions : 142 0.18/0.45 # Propositional unsat checks : 0 0.18/0.45 # Propositional check models : 0 0.18/0.45 # Propositional check unsatisfiable : 0 0.18/0.45 # Propositional clauses : 0 0.18/0.45 # Propositional clauses after purity: 0 0.18/0.45 # Propositional unsat core size : 0 0.18/0.45 # Propositional preprocessing time : 0.000 0.18/0.45 # Propositional encoding time : 0.000 0.18/0.45 # Propositional solver time : 0.000 0.18/0.45 # Success case prop preproc time : 0.000 0.18/0.45 # Success case prop encoding time : 0.000 0.18/0.45 # Success case prop solver time : 0.000 0.18/0.45 # Current number of processed clauses : 110 0.18/0.45 # Positive orientable unit clauses : 46 0.18/0.45 # Positive unorientable unit clauses: 0 0.18/0.45 # Negative unit clauses : 21 0.18/0.45 # Non-unit-clauses : 43 0.18/0.45 # Current number of unprocessed clauses: 293 0.18/0.45 # ...number of literals in the above : 775 0.18/0.45 # Current number of archived formulas : 0 0.18/0.45 # Current number of archived clauses : 380 0.18/0.45 # Clause-clause subsumption calls (NU) : 20553 0.18/0.45 # Rec. Clause-clause subsumption calls : 10325 0.18/0.45 # Non-unit clause-clause subsumptions : 88 0.18/0.45 # Unit Clause-clause subsumption calls : 183 0.18/0.45 # Rewrite failures with RHS unbound : 0 0.18/0.45 # BW rewrite match attempts : 21 0.18/0.45 # BW rewrite match successes : 16 0.18/0.45 # Condensation attempts : 0 0.18/0.45 # Condensation successes : 0 0.18/0.45 # Termbank termtop insertions : 48049 0.18/0.45 0.18/0.45 # ------------------------------------------------- 0.18/0.45 # User time : 0.104 s 0.18/0.45 # System time : 0.007 s 0.18/0.45 # Total time : 0.111 s 0.18/0.45 # Maximum resident set size: 2492 pages 0.18/0.45 EOF